On Immortal Configurations in Turing Machines
نویسنده
چکیده
We investigate the immortality problem for Turing machines and prove that there exists a Turing Machine that is immortal but halts on every recursive configuration. The result is obtained by combining a new proof of Hooper’s theorem [11] with recent results on effective symbolic dynamics.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملOn the presence of periodic configurations in Turing machines and in counter machines
A configuration of a Turing machine is given by a tape content together with a particular state of the machine. Petr Kůrka has conjectured that every Turing machine – when seen as a dynamical system on the space of its configurations – has at least one periodic orbit. In this paper, we provide an explicit counter-example to this conjecture. We also consider counter machines and prove that, in t...
متن کاملOn the Algebraic Representation of One-Tape Deterministic Turing Machine
An algebraic representation of the Turing machines is given, where the configurations of Turing machines are represented by 4 order tensors, and the transition functions by 8 order tensors. Two types of tensor product are defined, one is to model the evolution of the Turing machines, and the other is to model the compositions of transition functions. It is shown that the two types of tensor pro...
متن کاملConcurrent Turing Machines as Rewrite Theories
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class of (constant) khead Turing machines. Concurrent Turing machines correspond to a class of multiset rewriting systems. The definition of a CTMs as a rewrite theory avoids the need for encoding multisets as words and using...
متن کاملA Variant of Turing Machines with no Control States and its Connection to Bounded Temporal Memory
We present a variant with no control states of the Turing machine model of computation in which, at each computation step, the operation to be performed next is determined by the symbol currently scanned and by a bounded-length suffix of the sequence of the operations already executed on the tape. We show that our variant is Turing complete, i.e., it can simulate any (standard) Turing machine. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012